/* Copyright (C) 2013-2021 TU Dortmund
 * This file is part of AutomataLib, http://www.automatalib.net/.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package net.automatalib.util.graphs.traversal;

public interface DFSVisitor<N, E, D> {

    D initialize(N node);

    void explore(N node, D data);

    void finish(N node, D data);

    D treeEdge(N srcNode, D srcData, E edge, N tgtNode);

    void backEdge(N srcNode, D srcData, E edge, N tgtNode, D tgtData);

    void crossEdge(N srcNode, D srcData, E edge, N tgtNode, D tgtData);

    void forwardEdge(N srcNode, D srcData, E edge, N tgtNode, D tgtData);

    void backtrackEdge(N srcNode, D srcDate, E edge, N tgtNode, D tgtData);
}
